import java.util.*;

/**
 * 本小猴
 * https://www.nowcoder.com/practice/17865bc2a75c4944a872ef709958c56e?tpId=290&tqId=39933&ru=/exam/oj
 */
public class Main {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        char[] s = in.nextLine().toCharArray();

        int[] hash = new int[26];
        int max = 0, min = Integer.MAX_VALUE;
        for (char x : s) {
            hash[x - 'a']++;
        }
        for (int i = 0; i < 26; i++) {
            int t = hash[i];
            if (t > max) max = t;
            if (t < min && t != 0) min = t;
        }

        int num = max - min;

        if (isPrim(num)) {
            System.out.println("Lucky Word");
            System.out.println(num);

        } else {
            System.out.println("No Answer");
            System.out.println(0);

        }
    }

    static boolean isPrim(int num) {
        if (num == 0 || num == 1) return false;

        for (int i = 2; i <= Math.sqrt(num); i++)
            if (num % i == 0) return false;

        return true;
    }
}


/**
 * 主持人调度
*https://www.nowcoder.com/practice/e160b104354649b69600803184094adb?tpId=196&tqId=40514&ru=/exam/oj
 */
 class Solution {

    public boolean hostschedule (ArrayList<ArrayList<Integer>> schedule) {
        int m = schedule.size(),n = schedule.get(0).size();

        int arr[][] = new int[m][n];
        for(int i = 0;i < m;i++){
            for(int j = 0;j < n;j++){
                arr[i][j] = schedule.get(i).get(j);
            }
        }

        //排序
        Arrays.sort(arr,(a,b) -> {
            return a[0] - b[0];
        });


        for(int i = 1;i < m;i++){
            if(arr[i][0] < arr[i-1][1]) return false;
        }

        return true;
    }
}


/**
 * 分割等和子集
 * https://www.nowcoder.com/practice/65ade309fa4d4067a9add749721bfdc0?tpId=230&tqId=40433&ru=/exam/oj
 */
class Main1
{
    //01背包
    static int m = 510;
    static int n = 510 * 110;
    static boolean[][] dp = new boolean[m][n];
    public static void main(String[] args)
    {
        Scanner in = new Scanner(System.in);

        int len = in.nextInt();
        int sum = 0;
        int arr[] = new int[len + 1];
        for(int i = 0;i < len;i++){
            arr[i] = in.nextInt();
            sum += arr[i];
        }

        int tem = sum / 2;
        if(sum % 2 == 1) System.out.println("false");
        else{
            dp[0][0] = true;
            for(int i = 1;i <= len;i++){
                for(int j = 0;j <= sum;j++){
                    //dp【i][j]表示从i个物品中挑选和为j的物品
                    dp[i][j] = dp[i-1][j];
                    if(j >= arr[i]){
                        dp[i][j] = (dp[i][j] || dp[i-1][j - arr[i]]);
                    }
                }
            }

            if(dp[len][tem]) System.out.println("true");
            else System.out.println("false");
        }
    }
}